Proving set inclusion via intervals: application to parametric robust stability
نویسندگان
چکیده
منابع مشابه
Proving set inclusion via intervals: application to parametric robust stability
Proving that an uncertain parametric model is stable amounts to prove the inclusion of two sets: the set A of all feasible parameters and the set B of all parameters for which the model is stable. In this paper, a new algorithm, able to decide whether or not A is included in B, is presented. The method is based on interval analysis which is a numerical tool able to deal with inequalities in a g...
متن کاملProving set inclusion via intervals: application to parametric robust stability1
Proving that an uncertain parametric model is stable amounts to prove the inclusion of two sets: the set A of all feasible parameters and the set B of all parameters for which the model is stable. In this paper, a new algorithm, able to decide whether or not A is included in B, is presented. The method is based on interval analysis which is a numerical tool able to deal with inequalities in a g...
متن کاملParametric Robust Stability
Robust stability of LTI systemswith parametric uncertainty is a very interesting topic to study, industrial world is contained in parametric uncertainty. In industrial reality, there is not a particular system to analyze, there is a family of systems to be analyzed because the values of physical parameters are not known, we know only the lower and upper bounds of each parameter involved in the ...
متن کاملSet Partitioning via Inclusion-Exclusion
Given a set N with n elements and a family F of subsets, we show how to partition N into k such subsets in 2nnO(1) time. We also consider variations of this problem where the subsets may overlap or are weighted, and we solve the decision, counting, summation, and optimisation versions of these problems. Our algorithms are based on the principle of inclusion–exclusion and the zeta transform. In ...
متن کاملSet multi-covering via inclusion-exclusion
Set multi-covering is a generalization of the set covering problem where each element may need to be covered more than once and thus some subset in the given family of subsets may be picked several times for minimizing the number of sets to satisfy the coverage requirement. In this paper, we propose a family of exact algorithms for the set multi-covering problem based on the inclusionexclusion ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 1999
ISSN: 0005-1098
DOI: 10.1016/s0005-1098(98)00201-5